#pragma once
#include"Hash.h"
template<class K, class Hash = HashFunc<K>>
class Unordered_Set
{
public:
	struct KeyOfSet
	{
		const K& operator()(const K& key)
		{
			return key;
		}
	};
	typedef typename HashTables<K,const K, KeyOfSet,Hash>::Iterator iterator;
	typedef typename HashTables<K, const K, KeyOfSet, Hash>::ConstIterator const_iterator;

	iterator begin()
	{
		return _ht.Begin();
	}
	iterator end()
	{
		return _ht.End();
	}

	const_iterator begin() const
	{
		return _ht.Begin();
	}
	const_iterator end()const
	{
		return _ht.End();
	}

	pair<iterator,bool> insert(const K& key)
	{
		return _ht.Insert(key);
	}

	iterator find(const K& key)
	{
		return _ht.Find(key);
	}
	bool erase(const K& key)
	{
		return _ht.Erase(key);
	}

private:
	HashTables<K,const K, KeyOfSet, Hash> _ht;
};